LOS Signal Identification Based on Common Chord Intersection Point Position Deviation from MS in Target Localization

نویسندگان

چکیده

Target localization has been a popular research topic in recent years since it is the basis of all kinds location-based applications. For GNSS-denied urban or indoor environments, method based on time-of-arrival (TOA) one most methods due to its high accuracy and simplicity. However, Non-line-of-sight (NLOS) error major cause that degrades TOA-based method. Identifying whether received signal at base station (BS) line-of-sight (LOS) transmission NLOS key methods. In LOS identification methods, compared with statistic machine learning geometric constraint advantages simplicity without requiring priori knowledge signals large amounts training datasets. this paper, we propose two-step common chord intersection point position deviation from mobile stations (MS). first step, BSs are divided into multiple BS combinations every three BSs, TOA distance each combination estimated MS, whose satisfy Gaussian distribution roughly identified as enter second other discarded combination. mutual threshold discrimination result matrix, points combination, corresponding identified. The ultimately. Compared two proposed algorithm better accuracy, setting value theoretical basis, which facilitates application algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Opaque Information, Deviation from Target Leverage and Speed of Adjustment

Information opacity leads to information asymmetry. In this situation, in providing their own financial needs, firms face limitations and inevitably provide their financial needs from the debt market by signalling private information to it. In addition, information opacity affects the leverage adjustment speed. This research investigates the effect of information opacity on deviation from targe...

متن کامل

Intersection Information Based on Common Randomness

The introduction of the partial information decomposition generated a flurry of proposals for defining an intersection information that quantifies how much of “the same information” two or more random variables specify about a target random variable. As of yet, none is wholly satisfactory. A palatable measure of intersection information would provide a principled way to quantify slippery concep...

متن کامل

Deviation from Target Leverage and Leverage Adjustment Speed in Firms with Small Positive Earnings

This study investigates whether deviation from target leverage (leverage adjustment speed) in firms with small positive earnings (i.e., SPOS) is higher (slower) than that of other firms. We find evidence suggesting that managers of SPOS manipulate sales, production processes, and discretionary expenses to avoid reporting losses. Our results show that deviation from target leverage in SPOS is hi...

متن کامل

Increasing-Chord Graphs On Point Sets

We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P . Further, we prove that, for every convex point set P with n points, there exists an increasingchord graph with O(n log n) edges (and with no Steiner points) spanning P .

متن کامل

Iterative scheme based on boundary point method for common fixed‎ ‎point of strongly nonexpansive sequences

Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13042566